A Systolic LLR Generation Architecture for Non-Binary LDPC Decoders
نویسندگان
چکیده
منابع مشابه
Complexity Comparison of Non-Binary LDPC Decoders
This paper presents a detailed complexity study of the existing non-binary LDPC decoding algorithms in order to rigorously compare them from a hardware perspective. The Belief Propagation algorithm is first considered as well as its derivative versions in the frequency and logarithm domains. We then focus on the Extended Min-Sum and its recent simplified version. For each algorithm, the number ...
متن کاملLDPC Decoder LLR Stopping Criterion
The log-likelihood ratio test on a single check node within the LDPC decoder is monitored to develop a stopping criterion for the decoder that is better than previous stopping criteria, without sacrificing the BER performance. Simulation results are presented for the transmission of the rate 1 2 (288, 576) WiMAX 802.16e LDPC code digits using binary phase shift keying (BPSK) over an AWGN channel.
متن کاملLow Cost Quasi Binary Weighting Addition Log-SPA LDPC Decoders
This paper proposes a new addition method, which can be applied to reduce the hardware cost of LDPC decoders using log-SPA, which traditionally has the best lowest bit error rate (BER) but the highest hardware requirement. The proposed quasi-binary weighting addition can be simply implemented by OR gates. With auxiliary pseudo-carry circuit, the BER performance can reach a fair level. In the lo...
متن کاملHigh-throughput LDPC decoders
A high-throughput memory-efficient decoder architecture for low-density parity-check (LDPC) codes is proposed based on a novel turbo decoding algorithm. The architecture benefits from various optimizations performed at three levels of abstraction in system design—namely LDPC code design, decoding algorithm, and decoder architecture. First, the interconnect complexity problem of current decoder ...
متن کاملLow-Complexity Modified Trellis-Based Min-Max Non- Binary LDPC Decoders
Non-Binary Low-Density Parity-Check (NBLDPC) codes over GF(q) (q > 2) have better errorcorrecting performance than their binary counterparts when the codeword length is moderate. In this paper, modified trellis-based Minmax decoders are proposed for NB-LDPC codes. By relaxing the constraints on which messages can be included, the trellis syndrome computation is simplified without sacrificing th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2011
ISSN: 1089-7798
DOI: 10.1109/lcomm.2011.061611.110268